Some generalized type functional dependencies formalized as equality set on matrices
نویسندگان
چکیده
منابع مشابه
Removing XML Data Redundancies Using Functional and Equality-Generating Dependencies
We study the design issues of data-centric XML documents where (1) there are no mixed contents, i.e., each element may have some subelements and attributes, or it may have a single value in the form of a character string, but not a mixture of strings and subelements and/or attributes, (2) the ordering of subelements is of no significance. We provide a new definition of functional dependency (FD...
متن کاملType Classes with Functional Dependencies
Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For example, type classes are used to support equality and numeric types, and for monadic programming. A commonly requested extension to support ‘multiple parameters’ allows a more general interpretation of classes as relations on ...
متن کاملGeneralized and Formalized Uncurrying
Uncurrying is a termination technique for applicative term rewrite systems. During our formalization of uncurrying in the theorem prover Isabelle, we detected a gap in the original pen-and-paper proof which cannot directly be filled without further preconditions. Our final formalization does not demand additional preconditions, and generalizes the existing techniques since it allows to uncurry ...
متن کاملOn Generalized Intuitionistic Soft Equality
Park et al. (2011) introduced the concept of generalized intuitionistic fuzzy soft sets, which can be seen as an effective mathematical tool to deal with uncertainties. In this paper, the concept of generalized intuitionistic fuzzy soft equality is introduced and some related properties are derived. It is proved that generalized intuitionistic fuzzy soft equality is congruence relation with res...
متن کاملOn the non-existence of some generalized Hadamard matrices
A conjecture for generalized Hadamard matrices over group G of order p states that Hadamard matrix GH(p, h) exists only if the matrices In and nIn are Hermitian congruent [1], where n = ph and p is prime. References (4,5] document many parameter values for which non-existence is known to occur. Here, methods for establishing non-existence based upon a fundamental necessary condition of Brock [2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1983
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90098-7